Compact linearization for binary quadratic problems subject to assignment constraints
نویسندگان
چکیده
منابع مشابه
Compact Linearization for Binary Quadratic Problems subject to Assignment Constraints
We prove new necessary and sufficient conditions to carry out a compact linearization approach for a general class of binary quadratic problems subject to assignment constraints as it has been proposed by Liberti in 2007. The new conditions resolve inconsistencies that can occur when the original method is used. We also present a mixed-integer linear program to compute a minimally-sized lineari...
متن کاملCompact linearization for binary quadratic problems
We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer problems subject to assignment constraints. The resulting linearized formulation is more compact and tighter than that obtained with a more usual linearization technique. We discuss the application of the compact linearizatio...
متن کاملA new linearization method for quadratic assignment problems
The quadratic assignment problem (QAP) is one of the great challenges in combinatorial optimization. Linearization for QAP is to transform the quadratic objective function into a linear one. Numerous QAP linearizations have been proposed, most of which yield mixed integer linear programs (MILP). Kauffmann and Broeckx’s linearization (KBL) is the current smallest one in terms of the number of va...
متن کاملA rank preserving flow algorithm for quadratic optimization problems subject to quadratic equality constraints
This paper concerns quadratic programming problems subject to quadratic equality constraints such as arise in broadband antenna array signal processing and elsewhere. At first, such a problem is converted into a semidefinite programming problem with a rank constraint. Then, a rank preserving flow is used to accommodate the rank constraint. The associated gradient formulas are carefully develope...
متن کاملGlobal Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
We consider nonconvex quadratic optimization problems with binary constraints. Our main result identifies a class of quadratic problems for which a given feasible point is global optimal. We also establish a necessary global optimality condition. These conditions are expressed in a simple way in terms of the problem’s data. We also study the relations between optimal solutions of the nonconvex ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2017
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-017-0364-0